Stable Assignment with Couples: Parameterized Complexity and Local Search
نویسندگان
چکیده
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents are allowed to form pairs and submit joint rankings over hospitals. We use the framework of parameterized complexity, considering the number of couples as a parameter. We also apply a local search approach, and examine the possibilities for giving FPT algorithms applicable in this context. Furthermore, we also investigate the matching problem containing couples that is the simplified version of the Hospitals/Residents with Couples problem modeling the case when no preferences are given.
منابع مشابه
Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملThe Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the number of clauses satisfied by a given truth assignment by flipping the truth values of at most k variables (k-flip local search). For a total number of n variables the size of the search space is of order nk and grow...
متن کاملNP-Complete Stable Matching Problems
This paper concerns the complexity analysis of the roommate problem and intern assignment problem with couples. These are two special cases of the matching problems known as stable matching. The roommate problem is that of assigning a set of people to rooms of exactly two occupants in accordance with the preferences of the members of the set. The intern assignment problem with couples is that o...
متن کاملFaster Randomized Branching Algorithms for $r$-SAT
The problem of determining if an r-CNF boolean formula F over n variables is satisifiable reduces to the problem of determining if F has a satisfying assignment with a Hamming distance of at most d from a fixed assignment α [DGH02]. This problem is also a very important subproblem in Schöning’s local search algorithm for r-SAT [Sch99]. While Schöning described a randomized algorithm solves this...
متن کاملDelay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems
In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...
متن کامل